Constrained Information Pattern reconfiguration in Fault tolerant control of distributed systems
نویسندگان
چکیده
منابع مشابه
Fault Tolerant Distributed Information Systems
Critical infrastructures provide services upon which society depends heavily; these applications are themselves dependent on distributed information systems for all aspects of their operation and so survivability of the information systems is an important issue. Fault tolerance is a key mechanism by which survivability can be achieved in these information systems. We outline a specification-bas...
متن کاملAn Approach to Manage Reconfiguration in Fault- Tolerant Distributed Systems
This paper deals with dynamic resource management for real–time dependability–critical distributed systems. Requirements for such kind of systems span many domains such as time, survivability, and scalability and point out formidable challenges in terms of their fulfillment. An architecture is proposed, based on the agent distributed infrastructure Lira, and enriched with statistical models for...
متن کاملDesign of Distributed Fault Tolerant Control Systems
When dealing with large-scale complex networked control systems, designing FDI/FTC systems is a very difficult task due to the large number of sensors and actuators spatially distributed and networked connected. Despite the research effort on developing FTC systems for NCS most of these developments still being designed globally leading to centralized FTC solutions inadequate to NCS or, assume ...
متن کاملFault-tolerant Distributed Systems
Distributed systems have two key advantages: they increase the quality of our interaction with computers and the quantity of resources available to us. The quality increases as components of a distributed system hide failures from users and render a service more reliable (safer from loss) andmore available (less downtime). Increases in quantity, such as computational power and storage capacity,...
متن کاملDistributed Fault-Tolerant Ring Embedding and Reconfiguration in Hypercubes
To embed a ring in a hypercube is to find a Hamiltonian cycle through every node of the hypercube. It is obvious that no 2 n node Hamiltonian cycle exists in an n-dimensional faulty hypercube which has at least one faulty node. However, if a hypercube has faulty links only and the number of faulty links is at most n − 2, at least one 2 n -node Hamiltonian cycle can be found. In this paper, we p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2015
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2015.09.705